import math
from re import L
import sys,bisect
from collections import deque,OrderedDict,defaultdict
import heapq
from collections import Counter
def inp(): return sys.stdin.readline().rstrip()
def mpp(): return map(int,inp().split())
def lis(): return list(mpp())
def yn(n):
if n:
return "YES"
else:
return "NO"
def rt(i,n):
return 0<=i<n
def fn(arr,n,m):
for i in range(n):
for j in range(m):
if arr[i][j]=="S":
if rt(i-1,n):
if arr[i-1][j]!="W" and arr[i-1][j]!="S":
arr[i-1][j]="D"
elif arr[i-1][j]=="W":
print("NO")
return
if rt(i+1,n) :
if arr[i+1][j]!="W" and arr[i+1][j]!="S":
arr[i+1][j]="D"
elif arr[i+1][j]=="W":
print("NO")
return
if rt(j-1,m) :
if arr[i][j-1]!="W" and arr[i][j-1]!="S":
arr[i][j-1]="D"
elif arr[i][j-1]=="W":
print("NO")
return
if rt(j+1,m):
if arr[i][j+1]!="W" and arr[i][j+1]!="S":
arr[i][j+1]="D"
elif arr[i][j+1]=="W":
print("NO")
return
print("YES")
for i in range(n):
print("".join(arr[i]))
return
def main():
n,m=mpp()
if n==m:
print(n)
else:
print(2)
if __name__=="__main__":
main()// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, n;
cin>>l>>n;
if(l==n){
cout<<l<<'\n';
}else{
cout<<2<<'\n';
}
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |